Two word rings

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Word Problem and Relations in Rings

This is a report on current research into the word problem and relations in noncommutative rings. My interest in computational problems in ring theory predates my interest in computers and I have done work with computers on these problems for a long time. A major breakthrough occurred in about 1997 when I discovered an algorithm, similar to the Gröbner Basis algorithm, which applied to polynomi...

متن کامل

Solving the Word Problem for Two Classes of Non-associative Rings by Rewriting

Using the notion of modified completion given in Widiger, A. (1998, Deciding degreefour-identities for alternative rings by rewriting. In Bronstein, M., Grabmeier, J., Weispfenning, V. eds, Symbolic Rewriting Techniques, PCS 15, pp. 277–288. BirkhäuserVerlag), it is shown that the word problem for the varieties of non-associative rings defined by (xy)z = y(zx) and (xy)z = y(xz) respectively can...

متن کامل

Mesoscopic rings : two - fluid model

Kinetics of magnetic flux in the thin mesoscopic ring biased by an external magnetic flux exhibits the ratchet-like behavior. The 'flux velocity', i.e. the averaged time derivative of magnetic flux produced by the ring, is a candidate for a novel characteristics of mesoscopic rings. Its global properties reflect the possibility of accommodating persistent currents in the ring. 1 Mesoscopic ring...

متن کامل

The Complexity of the Word-problem for Finite Matrix Rings

We analyze the so-called word-problem for M2(Z2), the ring of 2 × 2 matrices over Z2. We prove that the term-equivalence problem for the semigroup (and so for the ring) M2(Z2) is coNP-complete.

متن کامل

Two-Variable Word Equations

We consider languages expressed by word equations in two variables and give a complete characterization for their complexity functions, that is, the functions that give the number of words of the same length. Speci cally, we prove that there are only ve types of complexities: constant, linear, exponential, and two in between constant and linear. For the latter two, we give precise characterizat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1956

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1956-0081266-0